Cost-Parity and Cost-Streett Games
نویسندگان
چکیده
We consider two-player games played on finite graphs equipped with costs on edges and introduce two winning conditions, cost-parity and cost-Streett, which require bounds on the cost between requests and their responses. Both conditions generalize the corresponding classical ω-regular conditions as well as the corresponding finitary conditions. For cost-parity games we show that the first player has positional winning strategies and that determining the winner lies in NP∩ coNP. For cost-Streett games we show that the first player has finite-state winning strategies and that determining the winner is EXPTIME-complete. This unifies the complexity results for the classical and finitary variants of these games. Both types of cost games can be solved by solving linearly many instances of their classical variants. 1998 ACM Subject Classification D.2.4 Software/Program Verification
منابع مشابه
Parity and Streett Games with Costs
We study two-player games played on finite graphs equipped with costs on edges and introduce two winning conditions, cost-parity and cost-Streett, which require bounds on the cost between requests and their responses. Both conditions generalize the corresponding classical omega-regular conditions and the corresponding finitary conditions. For parity games with costs we show that the first playe...
متن کاملGeneralized Parity Games
We consider games where the winning conditions are disjunctions (or dually, conjunctions) of parity conditions; we call them generalized parity games. These winning conditions, while ω-regular, arise naturally when considering fair simulation between parity automata, secure equilibria for parity conditions, and determinization of Rabin automata. We show that these games retain the computational...
متن کاملStrategy Construction in Infinite Ganes with Streett and Rabin Chain Winning Conditions
We consider nite-state games as a model of nonterminating reactive computations. A natural type of speciication is given by games with Streett winning condition (corresponding to automata accepting by conjunctions of fairness conditions). We present an algorithm which solves the problem of program synthesis for these speciications. We proceed in two steps: First, we give a reduction of Streett ...
متن کاملCooperative Benefit and Cost Games under Fairness Concerns
Solution concepts in cooperative games are based on either cost games or benefit games. Although cost games and benefit games are strategically equivalent, that is not the case in general for solution concepts. Motivated by this important observation, a new property called invariance property with respect to benefit/cost allocation is introduced in this paper. Since such a property can be regar...
متن کاملFinitary Winning in ω-Regular Games
Games on graphs with ω-regular objectives provide a model for the control and synthesis of reactive systems. Every ω-regular objective can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually.” Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transit...
متن کامل